HLA*LA—HLA typing from linearly projected graph alignments
نویسندگان
چکیده
منابع مشابه
Typing Graph-Manipulation Operations
We present a graph-based data model called GDM where database instances and database schemas are described by certain types of labeled graphs called instance graphs and schema graphs. For this data model we introduce two graph-manipulation operations, an addition and a deletion, that are based on pattern matching and can be represented in a graphical way. For these operations it is investigated...
متن کاملTyping of Graph Transformation Units
The concept of graph transformation units in its original sense is a structuring principle for graph transformation systems which allows the interleaving of rule applications with calls of imported units in a controlled way. The semantics of a graph transformation unit is a binary relation on an underlying type of graphs. In order to get a flexible typing mechanism for transformation units and ...
متن کاملQuasi-Linearly Polarization-Independent Liquid Crystal Lens by Means of Flow-Induced Alignments in the Cells
Given their specific electro-optical characteristics, liquid crystals (LCs) are usually used to study and fabricate optical devices for applications. The early study of LC lenses began in the 1970s and immediately became an interesting topic because of their unique optical capabilities. Especially, several innovative types of LC lenses had been proposed including a lens with circular hole-patte...
متن کاملA fast projected fixed-point algorithm for large graph matching
We propose a fast approximate algorithm for large graph matching. A new projected fixed-point method is defined and a new doubly stochastic projection is adopted to derive the algorithm. Previous graph matching algorithms suffer from high computational complexity and therefore do not have good scalability with respect to graph size. For matching two weighted graphs of n nodes, our algorithm has...
متن کاملSmooth-projected Neighborhood Pursuit for High-dimensional Nonparanormal Graph Estimation
We introduce a new learning algorithm, named smooth-projected neighborhood pursuit, for estimating high dimensional undirected graphs. In particularly, we focus on the nonparanormal graphical model and provide theoretical guarantees for graph estimation consistency. In addition to new computational and theoretical analysis, we also provide an alternative view to analyze the tradeoff between com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2019
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/btz235